0.00/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.13/0.14	% Command    : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC
0.14/0.36	% Computer   : n015.cluster.edu
0.14/0.36	% Model      : x86_64 x86_64
0.14/0.36	% CPU        : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.36	% Memory     : 8042.1875MB
0.14/0.36	% OS         : Linux 3.10.0-693.el7.x86_64
0.14/0.36	% CPULimit   : 1200
0.14/0.36	% WCLimit    : 120
0.14/0.36	% DateTime   : Tue Jul 13 14:22:49 EDT 2021
0.14/0.36	% CPUTime    : 
0.14/0.36	% Number of cores: 8
0.14/0.36	% Python version: Python 3.6.8
0.14/0.36	# Version: 2.6rc1-ho
0.14/0.37	# No SInE strategy applied
0.14/0.37	# Trying AutoSched0 for 59 seconds
2.63/2.83	# AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y
2.63/2.83	# and selection function SelectMaxLComplexAvoidPosPred.
2.63/2.83	#
2.63/2.83	# Preprocessing time       : 0.064 s
2.63/2.83	
2.63/2.83	# Proof found!
2.63/2.83	# SZS status Theorem
2.63/2.83	# SZS output start CNFRefutation
2.63/2.83	thf(fact_20_left_Osimps, axiom, ![X6:a, X7:tree_a, X8:tree_a]:(heapIm1140443833left_a @ (t_a @ X6 @ X7 @ X8))=(X7), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_20_left_Osimps)).
2.63/2.83	thf(fact_5__C4_Oprems_C_I3_J, axiom, (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ la @ ra), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_5__C4_Oprems_C_I3_J)).
2.63/2.83	thf(fact_30_siftDown_Osimps_I4_J, axiom, ![X30:a, X31:tree_a, X32:tree_a, X6:a]:(((heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32)))=(t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32))<=ord_less_eq_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ X6)&(~(ord_less_eq_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ X6)=>(heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32)))=(t_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X6 @ (heapIm1140443833left_a @ (t_a @ X30 @ X31 @ X32)) @ (heapIm1257206334ight_a @ (t_a @ X30 @ X31 @ X32))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_30_siftDown_Osimps_I4_J)).
2.63/2.83	thf(fact_22_val_Osimps, axiom, ![X6:a, X21:tree_a, X22:tree_a]:(val_a @ (t_a @ X6 @ X21 @ X22))=(X6), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_22_val_Osimps)).
2.63/2.83	thf(fact_32_is__heap_Osimps_I3_J, axiom, ![X6:a, X30:a, X31:tree_a, X32:tree_a]:(is_heap_a @ (t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32))<=>(ord_less_eq_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ X6&is_heap_a @ (t_a @ X30 @ X31 @ X32))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_32_is__heap_Osimps_I3_J)).
2.63/2.83	thf(conj_0, conjecture, is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
2.63/2.83	thf(fact_17_Tree_Oexhaust, axiom, ![X203:tree_a]:((X203)!=(e_a)=>~(![X204:a, X205:tree_a, X206:tree_a]:(X203)!=(t_a @ X204 @ X205 @ X206))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_17_Tree_Oexhaust)).
2.63/2.83	thf(fact_34_right_Osimps, axiom, ![X6:a, X7:tree_a, X8:tree_a]:(heapIm1257206334ight_a @ (t_a @ X6 @ X7 @ X8))=(X8), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_34_right_Osimps)).
2.63/2.83	thf(fact_15_Tree_Odistinct_I1_J, axiom, ![X39:a, X40:tree_a, X41:tree_a]:(e_a)!=(t_a @ X39 @ X40 @ X41), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_15_Tree_Odistinct_I1_J)).
2.63/2.83	thf(fact_0__C4_Oprems_C_I2_J, axiom, is_heap_a @ ra, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_0__C4_Oprems_C_I2_J)).
2.63/2.83	thf(fact_4_True, axiom, ord_less_eq_a @ v1 @ v2, file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_4_True)).
2.63/2.83	thf(c_0_11, plain, ![X1051:a, X1052:tree_a, X1053:tree_a]:(heapIm1140443833left_a @ (t_a @ X1051 @ X1052 @ X1053))=(X1052), inference(variable_rename,[status(thm)],[fact_20_left_Osimps])).
2.63/2.83	thf(c_0_12, plain, ![X2:a, X8:tree_a, X7:tree_a]:(heapIm1140443833left_a @ (t_a @ X2 @ X7 @ X8))=(X7), inference(split_conjunct,[status(thm)],[c_0_11])).
2.63/2.83	thf(c_0_13, plain, (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ la @ ra), inference(split_conjunct,[status(thm)],[fact_5__C4_Oprems_C_I3_J])).
2.63/2.83	thf(c_0_14, plain, ![X30:a, X31:tree_a, X32:tree_a, X6:a]:((ord_less_eq_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ X6=>(heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32)))=(t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32)))&(~ord_less_eq_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ X6=>(heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X30 @ X31 @ X32)))=(t_a @ (val_a @ (t_a @ X30 @ X31 @ X32)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X6 @ (heapIm1140443833left_a @ (t_a @ X30 @ X31 @ X32)) @ (heapIm1257206334ight_a @ (t_a @ X30 @ X31 @ X32))))))), inference(fof_simplification,[status(thm)],[fact_30_siftDown_Osimps_I4_J])).
2.63/2.83	thf(c_0_15, plain, ![X918:a, X919:tree_a, X920:tree_a]:(val_a @ (t_a @ X918 @ X919 @ X920))=(X918), inference(variable_rename,[status(thm)],[fact_22_val_Osimps])).
2.63/2.83	thf(c_0_16, plain, (la)=(e_a), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12, c_0_13]), c_0_12])).
2.63/2.83	thf(c_0_17, plain, ![X1456:a, X1457:tree_a, X1458:tree_a, X1459:a]:((~ord_less_eq_a @ (val_a @ (t_a @ X1456 @ X1457 @ X1458)) @ X1459|(heapIm1091024090Down_a @ (t_a @ X1459 @ e_a @ (t_a @ X1456 @ X1457 @ X1458)))=(t_a @ X1459 @ e_a @ (t_a @ X1456 @ X1457 @ X1458)))&(ord_less_eq_a @ (val_a @ (t_a @ X1456 @ X1457 @ X1458)) @ X1459|(heapIm1091024090Down_a @ (t_a @ X1459 @ e_a @ (t_a @ X1456 @ X1457 @ X1458)))=(t_a @ (val_a @ (t_a @ X1456 @ X1457 @ X1458)) @ e_a @ (heapIm1091024090Down_a @ (t_a @ X1459 @ (heapIm1140443833left_a @ (t_a @ X1456 @ X1457 @ X1458)) @ (heapIm1257206334ight_a @ (t_a @ X1456 @ X1457 @ X1458))))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])).
2.63/2.83	thf(c_0_18, plain, ![X1293:a, X1294:a, X1295:tree_a, X1296:tree_a]:(((ord_less_eq_a @ (val_a @ (t_a @ X1294 @ X1295 @ X1296)) @ X1293|~is_heap_a @ (t_a @ X1293 @ e_a @ (t_a @ X1294 @ X1295 @ X1296)))&(is_heap_a @ (t_a @ X1294 @ X1295 @ X1296)|~is_heap_a @ (t_a @ X1293 @ e_a @ (t_a @ X1294 @ X1295 @ X1296))))&(~ord_less_eq_a @ (val_a @ (t_a @ X1294 @ X1295 @ X1296)) @ X1293|~is_heap_a @ (t_a @ X1294 @ X1295 @ X1296)|is_heap_a @ (t_a @ X1293 @ e_a @ (t_a @ X1294 @ X1295 @ X1296)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_32_is__heap_Osimps_I3_J])])])).
2.63/2.83	thf(c_0_19, plain, ![X8:tree_a, X7:tree_a, X2:a]:(val_a @ (t_a @ X2 @ X7 @ X8))=(X2), inference(split_conjunct,[status(thm)],[c_0_15])).
2.63/2.83	thf(c_0_20, plain, (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ va @ e_a @ ra), inference(rw,[status(thm)],[c_0_13, c_0_16])).
2.63/2.83	thf(c_0_21, negated_conjecture, ~is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])).
2.63/2.83	thf(c_0_22, plain, ![X2:a, X8:tree_a, X7:tree_a, X6:a]:((heapIm1091024090Down_a @ (t_a @ X6 @ e_a @ (t_a @ X2 @ X7 @ X8)))=(t_a @ X6 @ e_a @ (t_a @ X2 @ X7 @ X8))|~ord_less_eq_a @ (val_a @ (t_a @ X2 @ X7 @ X8)) @ X6), inference(split_conjunct,[status(thm)],[c_0_17])).
2.63/2.83	thf(c_0_23, plain, ![X1304:tree_a]:((X1304)=(e_a)|(X1304)=(t_a @ (esk96_1 @ X1304) @ (esk97_1 @ X1304) @ (esk98_1 @ X1304))), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_17_Tree_Oexhaust])])])).
2.63/2.83	thf(c_0_24, plain, ![X2:a, X6:a, X7:tree_a, X8:tree_a]:(ord_less_eq_a @ (val_a @ (t_a @ X2 @ X7 @ X8)) @ X6|~is_heap_a @ (t_a @ X6 @ e_a @ (t_a @ X2 @ X7 @ X8))), inference(split_conjunct,[status(thm)],[c_0_18])).
2.63/2.83	thf(c_0_25, plain, ![X886:a, X887:tree_a, X888:tree_a]:(heapIm1257206334ight_a @ (t_a @ X886 @ X887 @ X888))=(X888), inference(variable_rename,[status(thm)],[fact_34_right_Osimps])).
2.63/2.83	thf(c_0_26, plain, (va)=(v2), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_20]), c_0_19])).
2.63/2.83	thf(c_0_27, negated_conjecture, ~is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))), inference(split_conjunct,[status(thm)],[c_0_21])).
2.63/2.83	thf(c_0_28, plain, ![X8:tree_a, X7:tree_a, X6:a, X2:a]:((heapIm1091024090Down_a @ (t_a @ X2 @ e_a @ (t_a @ X6 @ X7 @ X8)))=(t_a @ X2 @ e_a @ (t_a @ X6 @ X7 @ X8))|~ord_less_eq_a @ X6 @ X2), inference(rw,[status(thm)],[c_0_22, c_0_19])).
2.63/2.83	thf(c_0_29, plain, ![X7:tree_a]:((X7)=(e_a)|(X7)=(t_a @ (esk96_1 @ X7) @ (esk97_1 @ X7) @ (esk98_1 @ X7))), inference(split_conjunct,[status(thm)],[c_0_23])).
2.63/2.83	thf(c_0_30, plain, ![X2:a, X6:a, X7:tree_a, X8:tree_a]:(ord_less_eq_a @ X2 @ X6|~is_heap_a @ (t_a @ X6 @ e_a @ (t_a @ X2 @ X7 @ X8))), inference(rw,[status(thm)],[c_0_24, c_0_19])).
2.63/2.83	thf(c_0_31, plain, ![X1460:a, X1461:tree_a, X1462:tree_a]:(e_a)!=(t_a @ X1460 @ X1461 @ X1462), inference(variable_rename,[status(thm)],[fact_15_Tree_Odistinct_I1_J])).
2.63/2.83	thf(c_0_32, plain, ![X2:a, X7:tree_a, X8:tree_a]:(heapIm1257206334ight_a @ (t_a @ X2 @ X7 @ X8))=(X8), inference(split_conjunct,[status(thm)],[c_0_25])).
2.63/2.83	thf(c_0_33, plain, (t_a @ v2 @ e_a @ (t_a @ v1 @ l1 @ r1))=(t_a @ v2 @ e_a @ ra), inference(rw,[status(thm)],[c_0_20, c_0_26])).
2.63/2.83	thf(c_0_34, negated_conjecture, ~is_heap_a @ (heapIm1091024090Down_a @ (t_a @ va @ e_a @ ra)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27, c_0_13]), c_0_16])).
2.63/2.83	thf(c_0_35, plain, ![X7:tree_a, X2:a]:((heapIm1091024090Down_a @ (t_a @ X2 @ e_a @ X7))=(t_a @ X2 @ e_a @ X7)|(X7)=(e_a)|~ord_less_eq_a @ (esk96_1 @ X7) @ X2), inference(spm,[status(thm)],[c_0_28, c_0_29])).
2.63/2.83	thf(c_0_36, plain, ![X2:a, X7:tree_a]:((X7)=(e_a)|ord_less_eq_a @ (esk96_1 @ X7) @ X2|~is_heap_a @ (t_a @ X2 @ e_a @ X7)), inference(spm,[status(thm)],[c_0_30, c_0_29])).
2.63/2.83	thf(c_0_37, plain, ![X2:a, X7:tree_a, X8:tree_a]:(e_a)!=(t_a @ X2 @ X7 @ X8), inference(split_conjunct,[status(thm)],[c_0_31])).
2.63/2.83	thf(c_0_38, plain, (t_a @ v1 @ l1 @ r1)=(ra), inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_32])).
2.63/2.83	thf(c_0_39, plain, ![X2:a, X6:a, X7:tree_a, X8:tree_a]:(is_heap_a @ (t_a @ X6 @ e_a @ (t_a @ X2 @ X7 @ X8))|~ord_less_eq_a @ (val_a @ (t_a @ X2 @ X7 @ X8)) @ X6|~is_heap_a @ (t_a @ X2 @ X7 @ X8)), inference(split_conjunct,[status(thm)],[c_0_18])).
2.63/2.83	thf(c_0_40, negated_conjecture, ~is_heap_a @ (heapIm1091024090Down_a @ (t_a @ v2 @ e_a @ ra)), inference(rw,[status(thm)],[c_0_34, c_0_26])).
2.63/2.83	thf(c_0_41, plain, ![X2:a, X7:tree_a]:((heapIm1091024090Down_a @ (t_a @ X2 @ e_a @ X7))=(t_a @ X2 @ e_a @ X7)|(X7)=(e_a)|~is_heap_a @ (t_a @ X2 @ e_a @ X7)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
2.63/2.83	thf(c_0_42, plain, (ra)!=(e_a), inference(spm,[status(thm)],[c_0_37, c_0_38])).
2.63/2.83	thf(c_0_43, plain, ![X8:tree_a, X7:tree_a, X6:a, X2:a]:(is_heap_a @ (t_a @ X2 @ e_a @ (t_a @ X6 @ X7 @ X8))|~is_heap_a @ (t_a @ X6 @ X7 @ X8)|~ord_less_eq_a @ X6 @ X2), inference(rw,[status(thm)],[c_0_39, c_0_19])).
2.63/2.83	thf(c_0_44, plain, is_heap_a @ ra, inference(split_conjunct,[status(thm)],[fact_0__C4_Oprems_C_I2_J])).
2.63/2.83	thf(c_0_45, negated_conjecture, ~is_heap_a @ (t_a @ v2 @ e_a @ ra), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])).
2.63/2.83	thf(c_0_46, plain, ![X2:a]:(is_heap_a @ (t_a @ X2 @ e_a @ ra)|~ord_less_eq_a @ v1 @ X2), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_38]), c_0_44])])).
2.63/2.83	thf(c_0_47, plain, ord_less_eq_a @ v1 @ v2, inference(split_conjunct,[status(thm)],[fact_4_True])).
2.63/2.83	thf(c_0_48, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47])]), ['proof']).
2.63/2.83	# SZS output end CNFRefutation
2.63/2.83	# Proof object total steps             : 49
2.63/2.83	# Proof object clause steps            : 29
2.63/2.83	# Proof object formula steps           : 20
2.63/2.83	# Proof object conjectures             : 7
2.63/2.83	# Proof object clause conjectures      : 5
2.63/2.83	# Proof object formula conjectures     : 2
2.63/2.83	# Proof object initial clauses used    : 12
2.63/2.83	# Proof object initial formulas used   : 11
2.63/2.83	# Proof object generating inferences   : 10
2.63/2.83	# Proof object simplifying inferences  : 16
2.63/2.83	# Training examples: 0 positive, 0 negative
2.63/2.83	# Parsed axioms                        : 240
2.63/2.83	# Removed by relevancy pruning/SinE    : 0
2.63/2.83	# Initial clauses                      : 530
2.63/2.83	# Removed in clause preprocessing      : 101
2.63/2.83	# Initial clauses in saturation        : 429
2.63/2.83	# Processed clauses                    : 5748
2.63/2.83	# ...of these trivial                  : 44
2.63/2.83	# ...subsumed                          : 3027
2.63/2.83	# ...remaining for further processing  : 2677
2.63/2.83	# Other redundant clauses eliminated   : 3089
2.63/2.83	# Clauses deleted for lack of memory   : 0
2.63/2.83	# Backward-subsumed                    : 63
2.63/2.83	# Backward-rewritten                   : 91
2.63/2.83	# Generated clauses                    : 108601
2.63/2.83	# ...of the previous two non-trivial   : 96900
2.63/2.83	# Contextual simplify-reflections      : 26
2.63/2.83	# Paramodulations                      : 95010
2.63/2.83	# Factorizations                       : 88
2.63/2.83	# NegExts                              : 122
2.63/2.83	# Equation resolutions                 : 3266
2.63/2.83	# Propositional unsat checks           : 0
2.63/2.83	#    Propositional check models        : 0
2.63/2.83	#    Propositional check unsatisfiable : 0
2.63/2.83	#    Propositional clauses             : 0
2.63/2.83	#    Propositional clauses after purity: 0
2.63/2.83	#    Propositional unsat core size     : 0
2.63/2.83	#    Propositional preprocessing time  : 0.000
2.63/2.83	#    Propositional encoding time       : 0.000
2.63/2.83	#    Propositional solver time         : 0.000
2.63/2.83	#    Success case prop preproc time    : 0.000
2.63/2.83	#    Success case prop encoding time   : 0.000
2.63/2.83	#    Success case prop solver time     : 0.000
2.63/2.83	# Current number of processed clauses  : 2498
2.63/2.83	#    Positive orientable unit clauses  : 77
2.63/2.83	#    Positive unorientable unit clauses: 4
2.63/2.83	#    Negative unit clauses             : 260
2.63/2.83	#    Non-unit-clauses                  : 2157
2.63/2.83	# Current number of unprocessed clauses: 91280
2.63/2.83	# ...number of literals in the above   : 577135
2.63/2.83	# Current number of archived formulas  : 0
2.63/2.83	# Current number of archived clauses   : 159
2.63/2.83	# Clause-clause subsumption calls (NU) : 755613
2.63/2.83	# Rec. Clause-clause subsumption calls : 150551
2.63/2.83	# Non-unit clause-clause subsumptions  : 1822
2.63/2.83	# Unit Clause-clause subsumption calls : 63116
2.63/2.83	# Rewrite failures with RHS unbound    : 0
2.63/2.83	# BW rewrite match attempts            : 83
2.63/2.83	# BW rewrite match successes           : 26
2.63/2.83	# Condensation attempts                : 0
2.63/2.83	# Condensation successes               : 0
2.63/2.83	# Termbank termtop insertions          : 2453722
2.63/2.83	
2.63/2.83	# -------------------------------------------------
2.63/2.83	# User time                : 2.420 s
2.63/2.83	# System time              : 0.051 s
2.63/2.83	# Total time               : 2.471 s
2.63/2.83	# Maximum resident set size: 2184 pages
2.63/2.83	EOF